package com.github.catvod.spider.merge;

import java.nio.charset.Charset;

public class qM {
  private static final byte[] V0;
  
  private static final Charset h = i.V0;
  
  private static final byte[] j;
  
  static {
    V0 = new byte[] { 
        65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 
        75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 
        85, 86, 87, 88, 89, 90, 97, 98, 99, 100, 
        101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 
        111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 
        121, 122, 48, 49, 50, 51, 52, 53, 54, 55, 
        56, 57, 43, 47 };
    j = new byte[] { 
        65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 
        75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 
        85, 86, 87, 88, 89, 90, 97, 98, 99, 100, 
        101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 
        111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 
        121, 122, 48, 49, 50, 51, 52, 53, 54, 55, 
        56, 57, 45, 95 };
  }
  
  public static byte[] V0(byte[] paramArrayOfbyte, boolean paramBoolean) {
    return j(paramArrayOfbyte, paramBoolean, false);
  }
  
  public static String h(byte[] paramArrayOfbyte) {
    return H.h(V0(paramArrayOfbyte, false), h);
  }
  
  public static byte[] j(byte[] paramArrayOfbyte, boolean paramBoolean1, boolean paramBoolean2) {
    int i;
    byte[] arrayOfByte1;
    if (paramArrayOfbyte == null)
      return null; 
    int i3 = paramArrayOfbyte.length;
    if (i3 == 0)
      return new byte[0]; 
    int i2 = i3 / 3 * 3;
    int n = i3 - 1;
    int j = n / 3 + 1 << 2;
    if (paramBoolean1) {
      i = (j - 1) / 76 << 1;
    } else {
      i = 0;
    } 
    int i1 = j + i;
    byte[] arrayOfByte2 = new byte[i1];
    if (paramBoolean2) {
      arrayOfByte1 = j;
    } else {
      arrayOfByte1 = V0;
    } 
    int m = 0;
    j = 0;
    int k;
    for (k = 0; m < i2; k = i) {
      i = m + 1;
      m = paramArrayOfbyte[m];
      int i4 = i + 1;
      i = (m & 0xFF) << 16 | (paramArrayOfbyte[i] & 0xFF) << 8 | paramArrayOfbyte[i4] & 0xFF;
      int i5 = j + 1;
      arrayOfByte2[j] = arrayOfByte1[i >>> 18 & 0x3F];
      m = i5 + 1;
      arrayOfByte2[i5] = arrayOfByte1[i >>> 12 & 0x3F];
      j = m + 1;
      arrayOfByte2[m] = arrayOfByte1[i >>> 6 & 0x3F];
      m = j + 1;
      arrayOfByte2[j] = arrayOfByte1[i & 0x3F];
      j = m;
      i = k;
      if (paramBoolean1) {
        k++;
        j = m;
        i = k;
        if (k == 19) {
          j = m;
          i = k;
          if (m < i1 - 2) {
            i = m + 1;
            arrayOfByte2[m] = 13;
            j = i + 1;
            arrayOfByte2[i] = 10;
            i = 0;
          } 
        } 
      } 
      m = i4 + 1;
    } 
    k = i3 - i2;
    if (k > 0) {
      byte b;
      j = paramArrayOfbyte[i2];
      if (k == 2) {
        i = (paramArrayOfbyte[n] & 0xFF) << 2;
      } else {
        i = 0;
      } 
      m = i | (j & 0xFF) << 10;
      arrayOfByte2[i1 - 4] = arrayOfByte1[m >> 12];
      arrayOfByte2[i1 - 3] = arrayOfByte1[m >>> 6 & 0x3F];
      if (paramBoolean2) {
        j = i1 - 2;
        i = j;
        if (2 == k) {
          arrayOfByte2[j] = arrayOfByte1[m & 0x3F];
          i = j + 1;
        } 
        paramArrayOfbyte = new byte[i];
        System.arraycopy(arrayOfByte2, 0, paramArrayOfbyte, 0, i);
        return paramArrayOfbyte;
      } 
      if (k == 2) {
        b = arrayOfByte1[m & 0x3F];
      } else {
        b = 61;
      } 
      arrayOfByte2[i1 - 2] = b;
      arrayOfByte2[i1 - 1] = 61;
    } 
    return arrayOfByte2;
  }
}


/* Location:              /Users/hetaiyi/Desktop/my/tech/java/study/aa/temp/temp.jar!/com/github/catvod/spider/merge/qM.class
 * Java compiler version: 6 (50.0)
 * JD-Core Version:       1.1.3
 */